Theoretical computer science - PDFSEARCH.IO - Document Search Engine

Theoretical computer science
Results: 9916

#	Item
131	Implement the method for finding the status of aqua pond and uncertainty handling in Aqua Data Sets using Rough Set Theory Suresh Babu Chandanapallia, Dr. E. Sreenivasa Reddy b , Dr. D. Rajya Lakshmi c a Associate Profe Add to Reading List Source URL: www.urisa.org Language: English - Date: 2016-05-12 15:30:59 Mathematics Logic Theoretical computer science Probability Rough set Fuzzy logic Expected value Fuzzy set Dominance-based rough set approach
132	Ensuring Agent Properties under Arbitrary Sequences of Incoming Events Stefania Costantini1 , Pierangelo Dell’Acqua2 , Lu´ıs Moniz Pereira3 , and Arianna Tocchio1 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2010-06-08 10:41:46 Philosophy Logic Theoretical computer science Temporal logic Logic in computer science Linear temporal logic Modal logic Causality Formal verification
133	MechanikaANGIELSKI-sty2010 Add to Reading List Source URL: wbmil.portal.prz.edu.pl Language: English - Date: 2010-01-05 06:46:27 Academia Engineering Theoretical computer science Academic transfer Course credit Education Mechanical engineering Turing machine
134	Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2008-05-15 11:50:35 Mathematics Computational complexity theory Dynamic programming Discrete mathematics Combinatorics Analysis of algorithms Algorithm Mathematical logic Theoretical computer science Time complexity FisherYates shuffle Longest increasing subsequence
135	Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll† Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-05-27 14:31:46 Information theory Randomness Metaphysics Theoretical computer science Theory of computation Entropy Kolmogorov complexity Sophistication Complexity Random sequence Algorithmic information theory Mutual information
136	Why and how to use arbitrary precision Kaveh R. Ghazi Vincent Lefèvre Philippe Théveny Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2010-04-14 11:12:59 Computer arithmetic Computing Mathematics Theoretical computer science GNU MPFR Extended precision Quadruple-precision floating-point format Rounding Single-precision floating-point format Double-precision floating-point format IEEE floating point Precision
137	Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings Claus Schr¨oter1 and Victor Khomenko2 1 Institut f¨ Add to Reading List Source URL: rodin.cs.ncl.ac.uk Language: English - Date: 2004-10-12 04:45:38 Models of computation Concurrency Diagrams Petri net Software engineering Symbol Model checking Theoretical computer science Metaphor
138	An Introduction to Logical Relations Proving Program Properties Using Logical Relations Lau Skorstengaard Contents Add to Reading List Source URL: www.cs.uoregon.edu Language: English - Date: 2016-06-30 02:06:10 Theoretical computer science Mathematical logic Computer science Logic in computer science Lambda calculus Models of computation Proof theory Computability theory Simply typed lambda calculus Natural deduction CurryHoward correspondence
139	/tmp/scitmpfigure3.eps Add to Reading List Source URL: nil.csail.mit.edu Language: English - Date: 2015-01-05 06:37:33 Logic Algorithm Mathematical logic Theoretical computer science Modal logic Philosophy Abstraction
140	Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la Add to Reading List Source URL: www.cs.ru.nl Language: English - Date: 2011-01-18 05:58:42 Mathematical logic Logic Type theory Theoretical computer science Lambda calculus Dependently typed programming Proof theory Logic in computer science CurryHoward correspondence Dependent type System F Simply typed lambda calculus

UPDATE